On Kernelization of Supervised Mahalanobis Distance Learners

نویسندگان

  • Ratthachat Chatpatanasiri
  • Teesid Korsrilabutr
  • Pasakorn Tangchanachaianan
  • Boonserm Kijsirikul
چکیده

This paper contains three contributions to the problem of learning a Mahalanobis distance. First, a general framework for kernelizing Mahalanobis distance learners is presented. The framework allows existing algorithms to learn a Mahalanobis distance in a feature space associated with a pre-specified kernel function. The framework is then used for kernelizing three well-known learners, namely, “neighborhood component analysis”, “large margin nearest neighbors” and “discriminant neighborhood embedding”; open problems of recent works are thus solved. Second, while the truths of representer theorems are just assumptions in previous papers related to ours, here representer theorems in the context of kernelized Mahalanobis distance learners are formally proven. Third, unlike previous works which demand cross validation to select a kernel, an inductive kernel alignment method based on quadratic programming is derived in this paper and is used to automatically select an efficient kernel function. Numerical results on various real-world datasets are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Kernelizing Mahalanobis Distance Learning Algorithms

This paper focuses on the problem of kernelizing an existing supervised Mahalanobis distance learner. The following features are included in the paper. Firstly, three popular learners, namely, “neighborhood component analysis”, “large margin nearest neighbors” and “discriminant neighborhood embedding”, which do not have kernel versions are kernelized in order to improve their classification per...

متن کامل

Determination of Best Supervised Classification Algorithm for Land Use Maps using Satellite Images (Case Study: Baft, Kerman Province, Iran)

According to the fundamental goal of remote sensing technology, the image classification of desired sensors can be introduced as the most important part of satellite image interpretation. There exist various algorithms in relation to the supervised land use classification that the most pertinent one should be determined. Therefore, this study has been conducted to determine the best and most su...

متن کامل

Investigating Distance Metrics in Semi-supervised Fuzzy c-Means for Breast Cancer Classification

In previous work, semi-supervised Fuzzy c-means (ssFCM) was used as an automatic classification technique to classify the Nottingham Tenovus Breast Cancer (NTBC) dataset as no method to do this currently exists. However, the results were poor when compared with semi-manual classification. It is known that the NTBC data is highly non-normal and it was suspected that this affected the poor result...

متن کامل

An investigation on scaling parameter and distance metrics in semi-supervised Fuzzy c-means

The scaling parameter α helps maintain a balance between supervised and unsupervised learning in semi-supervised Fuzzy c-Means (ssFCM). In this study, we investigated the effects of different α values, 0.1, 0.5, 1 and 10 in Pedrycz and Waletsky’s ssFCM with various amounts of labelled data, 10%, 20%, 30%, 40%, 50% and 60% and three distance metrics, Euclidean, Mahalanobis and kernel-based on th...

متن کامل

Comparison of Supervised Self-Organizing Maps Using Euclidian or Mahalanobis Distance in Classification Context

The supervised self-organizing map consists in associating output vectors to input vectors through a map, after self-organizing it on the basis of both input and desired output given altogether. This paper compares the use of Euclidian distance and Mahalanobis distance for this model. The distance comparison is made on a data classification application with either global approach or partitionin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0804.1441  شماره 

صفحات  -

تاریخ انتشار 2008